Finding the orthogonal projection of a point onto an affine subspace

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces

We present a modification of Dykstra’s algorithm which allows us to avoid projections onto general convex sets. Instead, we calculate projections onto either a halfspace or onto the intersection of two halfspaces. Convergence of the algorithm is established and special choices of the halfspaces are proposed. The option to project onto halfspaces instead of general convex sets makes the algorith...

متن کامل

Closed-loop Subspace Identification: an Orthogonal Projection Approach

In this paper, a closed-loop subspace identification approach through an orthogonal projection and subsequent singular value decomposition is proposed. As a by-product of this development, it explains why some existing subspace methods may deliver a bias in the presence of the feedback control and suggests a remedy to eliminate the bias. Furthermore, as the proposed method is a projection based...

متن کامل

TECHNICAL NOTE A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R"

An algorithm of successive location of the solution is developed for the problem of finding the projection of a point onto the canonical simplex in the Euclidean space R ~. This algorithm converges in a finite number of steps. Each iteration consists in finding the projection of a point onto an affine subspace and requires only explicit and very simple computations.

متن کامل

Spherical subspace and eigen based affine projection algorithms

In this paper, we combine spherical subspace (SS) and eigen based updating methods with the a ne projection (AP) method to produce a new family of fast SS-AP algorithms that o ers additional tradeo s between computation and adaptive ltering performance. Moreover, the implementation of SS-AP is less complicated than the fast RLS based AP algorithms. For certain applications, e.g., echo cancellat...

متن کامل

Unsupervised orthogonal subspace projection approach to magnetic resonance image classification

Chein-I Chang, FELLOW SPIE University of Maryland Baltimore County Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering Baltimore, Maryland 21250 E-mail: [email protected] Abstract. MR images and remotely sensed images share similar image structures and characteristics because they are acquired remotely as image sequences by spectral chan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2007

ISSN: 0024-3795

DOI: 10.1016/j.laa.2006.11.003